排序方式: 共有91条查询结果,搜索用时 15 毫秒
61.
This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
62.
63.
64.
IPv6具有巨大的地址空间,未来要面对的将会是海量IPv6路由表,而且128位的IPv6地址比IPv4需要更多的访存数。算法针对IPv6路由查找问题中的这两个难点,提出利用B树高度较低的优良性质,将前缀转化为范围表保存在B树中,并在结点内部利用分段范围比较树算法来减少访存次数和空间耗费。理论分析和实验表明,该算法能够以很好的性能支持IPv6海量路由表的查找。 相似文献
65.
本文研究了节点负载处理能力异质条件下的无标度网络交通动力学过程,提出了一种基于节点资源利用率的全局动态路由策略。该策略利用网络中节点资源利用率构建了一种全局代价函数,选择使该代价函数最小的路径来传输负载。实验结果表明该路由策略在略微增加平均路径长度的情况下成倍地提高了网络负载传输能力,与有效路由策略的比较进一步验证了该策略的有效性。 相似文献
66.
为了从能量均衡角度出发解决无线传感器网络生命周期延长问题,从而延长整个物联网生命周期,针对无线传感器网络节点遭遇"路由空洞"的时候出现路由中断和生命周期缩短现象,分析能量消耗原理,构建最优跳数模型和能量均衡协议,并提出采用能量均衡的思路减少节点能量消耗。实验仿真发现,应用能量均衡协议使无线传感器网络节点能量分布更加均匀,节点能量消耗时间明显变长,而个别节点能量消耗速度明显大于其他节点的情况得以减少,达到延长无线传感器网络生命周期的目的。仿真结果验证了该方法的可行性。 相似文献
67.
What you should know about the vehicle routing problem 总被引:1,自引:0,他引:1
Gilbert Laporte 《海军后勤学研究》2007,54(8):811-819
In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
68.
随着Internet的爆炸性增长,域间路由系统变得越来越复杂并难以控制,许多与域间路由安全相关的事件广泛引起了人们的关注。提出一个基于规则的域间路由监测框架,其中的规则可分为常规异常检测规则和特殊异常检测规则,它们能有效用于检测异常路由和可能的攻击行为,这两种规则的不同在于特殊异常检测规则是由大量路由得到的Internet模型来定义。研究了Internet层次模型与ISP商业关系模型的构造,基于这个框架实现了一个原型系统———ISP-Health,最后给出了检测能力结果。 相似文献
69.
70.
基于双路由单元研究了Space Wire总线的性能评价体系。研究中给出双路由单元的定义,推导基于双路由单元的路由系统的数据传输时间和资源耗费的计算方法;推导基于双路由单元的多路由拓扑系统的性能评价体系;采用蒙特卡洛模拟的方法建立双路由单元系统的模拟平台,仿真计算路由单元在不同接口配置情况下的性能。研究结果表明:基于双路由单元的传输时间和资源耗费指标能够评价Space Wire总线的性能;在不同接口配置时,存在一种最佳的配置方式使系统的性能达到最优。 相似文献